Genetics in Solving Dyslexia Puzzles

نویسندگان

  • Anna Wysocka
  • Małgorzata Lipowska
  • Adrianna Kilikowska
چکیده

Developmental dyslexia, or specific learning difficulties, is the most common neurobehavioral disorder affecting school-aged children, with a prevalence rate of 5-17.5%. Family and twin studies have pointed to a genetic component in the etiology of dyslexia. However, dyslexia is a complex disorder at both the genetic and environmental levels, and its nature so far remains unclear. Dyslexia is thought to be a ”complex trait” determined by a number of genes, each with small to moderate effects on the specific phenotype, involving various factors such as heterogeneity, incomplete penetrance, phenocopy, or oligogenic inheritance. Based on combined linkage and association analyses using both qualitative and quantitative phenotypes, multiple regions (DYX1-DYX9) on chromosomes 1, 2, 3, 6, 11, 13, 15 and 18 have been reported likely to contain genes contributing to dyslexia. Most recently four candidate genes (DYX1C1, KIAA0319, DCDC2, ROBO1) have been identified as associated with dyslexia. In this review, we focus on the genetic basis of dyslexia and provide an overview of several of the most susceptible loci on chromosomes and prominent candidate genes currently suspected of conditioning dyslexia.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The impact of using problem-solving puzzles on Iranian intermediate EFL learners' lexical knowledge

This study tried to investigate the impact of using problem-solving puzzles onIranian Intermediate EFL learners' lexical knowledge. At first a homogenoussample of 30 Intermediate EFL learners attending in the third grade of Shahedhigh school in Lahijan were selected and they were randomly divided into twogroups, as experimental group and control group. In the first session, the pretestwas admin...

متن کامل

Algorithmic Puzzles: History, Taxonomies, and Applications in Human Problem Solving

The paper concerns an important but underappreciated genre of algorithmic puzzles, explaining what these puzzles are, reviewing milestones in their long history, and giving two different ways to classify them. Also covered are major applications of algorithmic puzzles in cognitive science research, with an emphasis on insight problem solving, and the advantages of algorithmic puzzles over some ...

متن کامل

Solving Sudoku Puzzles Based on Customized Information Entropy

Conception and calculation method of information entropy is customized for Sudoku puzzles and a corresponding algorithm is designed to solve Sudoku puzzles. The definitions of inverse information entropy and information amount for inverse information entropy are also introduced and directly used instead of information entropy in order to simplify the solving procedure. Experimental results show...

متن کامل

Hardness Amplification of Weakly Verifiable Puzzles

Is it harder to solve many puzzles than it is to solve just one? This question has different answers, depending on how you define puzzles. For the case of inverting one-way functions it was shown by Yao that solving many independent instances simultaneously is indeed harder than solving a single instance (cf. the transformation from weak to strong one-way functions). The known proofs of that re...

متن کامل

Nonokenken: Solving Puzzles Using Integer Programs

We examine methods of integer programming in order to solve two of our favorite puzzles: nonograms and KenKen. The former is a puzzle in which each cell of a board must be colored either black or white. The clues provided in the puzzle indicate the number and length of black-cell clusters that must appear in each row and column of the board. The latter, KenKen, is a puzzle that requires the sol...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011